Ant navigation: resetting the path integrator
نویسندگان
چکیده
منابع مشابه
Resetting the path integrator: a basic condition for route-based navigation.
During short excursions away from home, some mammals are known to update their position with respect to their point of departure through path integration (dead reckoning) by processing internal (idiothetic) signals generated by rotations and translations. Path integration (PI) is a continuously ongoing process in which errors accumulate. To remain functional over longer excursions, PI needs to ...
متن کاملResetting the Clock Dexras1 Defines a Path
The signaling pathways by which light and activity shift the circadian clock are not well understood. In this issue of Neuron, Cheng et al. analyze mice lacking Dexras1 (a Ras family GTPase protein) and demonstrate an important role for G(i/o) signaling mediating both photic and nonphotic phase shifts of the circadian clock.
متن کاملHoming strategies of the Australian desert ant Melophorus bagoti. II. Interaction of the path integrator with visual cue information.
Individually foraging ants are known to return to their nest by using path-integration and recording visual information present in the environment. The interaction between the path integrator and the information provided by the visual cues in an Australian desert ant are reported here. Ants were trained to travel in a 1-m wide and 20-m long corridor of cylinders. Homeward paths of trained ants ...
متن کاملErratum Homing strategies of the Australian desert ant Melophorus bagoti. II. Interaction of the path integrator with visual cue information
The correct wording for the text is: Trajectories of ants displaced laterally were analysed in four categories based on their search patterns: (a) zero turns: paths that did not have any turns 50°; (b) one turn: paths of ants characterised by a single turn 50°, these are usually 90° turns directed towards the route-mark corridor; (c) zero loops: paths of ants with one or more turn/s 50°, but th...
متن کاملSolving the Shortest Path Problem in Vehicle Navigation System by Ant Colony Algorithm
A shortest path search method based on ant colony algorithm is proposed. The method contracts the search space appropriately, obtaining, in a short time, a path that is as close as possible to the path obtained by the Dijkstra method (the optimum path). To improve the performance, we modify the pheromone update rule and introduce a learning strategy into the ant colony algorithm. The method obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Experimental Biology
سال: 2006
ISSN: 1477-9145,0022-0949
DOI: 10.1242/jeb.01976